About an analytical verification of quasi-continuum methods with !-convergence techniques

نویسندگان

  • Mathias Schäffner
  • Anja Schlömerkemper
چکیده

Quasi-continuum (QC) methods are computational techniques, which reduce the complexity of atomistic simulations in a static setting while keeping information on smallscale structures and effects. The main idea is to couple atomistic and continuum models and thus to obtain quite detailed but still not too expensive numerical simulations. We aim at a mathematically rigorous verification of QC methods by means of discrete to continuum limits. In this article we present our first results for the so-called quasi-nonlocal QC method in the context of fracture mechanics. To this end we start from a one-dimensional chain of atoms with nearest and next-to-nearest neighbour interactions of Lennard-Jones type. This is considered as a fully atomistic model of which the !-limits (of zeroth and first order) for an infinite number of atoms are known [7]. The QC models we construct are equal to this fully atomistic model in the atomistic region; in the continuum regime we approximate the next-to-nearest neighbour interactions by some nearest neighbour potential which is related to the so-called Cauchy-Born rule. Further we choose certain representative atoms in order to coarsen the mesh in the continuum region. It turns out that the selection of the representative atoms is crucial and influences the !-limits. We regard a QC model as good if the !-limits of zeroth and first order or at least their minimal values and minimizers are the same as those of the fully atomistic model. Our analysis shows that, while in an elastic regime only the size of the atomistic region matters, in the case of fracture a proper choice of the representative atoms is an essential ingredient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing 10 Methods for Solution Verification, and Linking to Model Validation

Grid convergence is often assumed as a given during computational analyses involving discretization of an assumed continuum process. In practical use of finite difference and finite element analyses, perfect grid convergence is rarely achieved or assured, and this fact must be addressed to make statements about model validation or the use of models in risk analysis. We have previously provided ...

متن کامل

On the convergence speed of artificial neural networks in‎ ‎the solving of linear ‎systems

‎Artificial neural networks have the advantages such as learning, ‎adaptation‎, ‎fault-tolerance‎, ‎parallelism and generalization‎. ‎This ‎paper is a scrutiny on the application of diverse learning methods‎ ‎in speed of convergence in neural networks‎. ‎For this aim‎, ‎first we ‎introduce a perceptron method based on artificial neural networks‎ ‎which has been applied for solving a non-singula...

متن کامل

Comparison of acceleration techniques of analytical methods for solving differential equations of integer and fractional order

The work  addressed in this paper is a comparative study between convergence of the  acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method  and Adomian decomposition method for solving  differential equations of integer and fractional orders.

متن کامل

Some New Existence, Uniqueness and Convergence Results for Fractional Volterra-Fredholm Integro-Differential Equations

This paper demonstrates a study on some significant latest innovations in the approximated techniques to find the approximate solutions of Caputo fractional Volterra-Fredholm integro-differential equations. To this aim, the study uses the modified Adomian decomposition method (MADM) and the modified variational iteration method (MVIM). A wider applicability of these techniques are based on thei...

متن کامل

Validated Saddle-Node Bifurcations and Applications to Lattice Dynamical Systems

The use of rigorous verification methods is a powerful tool which permits progress in the analysis of dynamical processes that is not possible using purely analytical techniques. In this paper we develop a set of tools for branch validation, which allows for the rigorous verification of branch behavior, bifurcation, and solution index on branches generated through a saddle-node bifurcation. Whi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012